Zum Inhalt springen
- {{#headlines}}
- {{title}} {{/headlines}}
Profil
| Derzeitige Stellung | Professor W-3 und Äquivalente |
|---|---|
| Fachgebiet | Theoretische Informatik |
| Keywords | formal methods, game theory in formal verification, probabilistic model-checking, computer science, semantics |
Aktuelle Kontaktadresse
| Land | Tschechische Republik |
|---|---|
| Ort | Brno |
| Universität/Institution | Masaryk University |
| Institut/Abteilung | Institute for Theoretical Computer Science |
Gastgeber*innen während der Förderung
| Prof. Dr. Javier Esparza | Fakultät für Informatik, Technische Universität München, München |
|---|---|
| Prof. Dr. Javier Esparza | Institut für Formale Methoden der Informatik, Abteilung Theoretische Informatik, Universität Stuttgart, Stuttgart |
| Prof. Dr. Javier Esparza | Fakultät für Informatik, Technische Universität München, Garching |
| Beginn der ersten Förderung | 01.06.1998 |
Programm(e)
| 1998 | Humboldt-Forschungsstipendien-Programm |
|---|---|
| 2016 | Friedrich Wilhelm Bessel-Forschungspreis-Programm |
Projektbeschreibung der*des Nominierenden
| Professor Kučera is an international authority in computer-assisted verification and synthesis of computer systems. He has made important contributions to the theory of process algebras, the analysis of probabilistic systems and the application of game-theoretic techniques to verification and synthesis problems. In Germany, he will study algorithms for the analysis of specific resources and security games with exciting potential applications to the design of resource-aware components and to computer security. |
Publikationen (Auswahl)
| 2003 | Antonin Kucera, Javier Esparza: A Logical Viewpoint on Process-algebraic Quotients. In: Journal of Logic and Computation, 2003, 863-880 |
|---|---|
| 2003 | Javier Esparza, Antonin Kucera, Stefan Schwoon: Model checking LTL with regular valuations for pushdown systems. In: Information and Computation, 2003, 355-376 |
| 2002 | Antonin Kucera, Richard Mayr: Simulation Preorder over Simple Process Algebras. In: Information and Computation, 2002, 184-198 |
| 2002 | Antonin Kucera, Richard Mayr: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. In: Theoretical Computer Science, 2002, 677-700 |
| 2001 | Petr Jancar, Antonin Kucera, Richard Mayr: Deciding bisimulation-like equivalences with finite-state processes. In: Theoretical Computer Science, 2001, 409-433 |